CogBoost: Boosting for Fast Cost-Sensitive Graph Classification
نویسندگان
چکیده
منابع مشابه
Cost-Sensitive Boosting for Classification of Imbalanced Data
The classification of data with imbalanced class distributions has posed a significant drawback in the performance attainable by most well-developed classification systems, which assume relatively balanced class distributions. This problem is especially crucial in many application domains, such as medical diagnosis, fraud detection, network intrusion, etc., which are of great importance in mach...
متن کاملBoosting Cost-Sensitive Trees
This paper explores two techniques for boosting cost-sensitive trees. The two techniques diier in whether the misclassiication cost information is utilized during training. We demonstrate that each of these techniques is good at diierent aspects of cost-sensitive classiications. We also show that both techniques provide a means to overcome the weaknesses of their base cost-sensitive tree induct...
متن کاملBoosting Trees for Cost-Sensitive Classifications
This paper explores two boosting techniques for cost-sensitive tree classiications in the situation where misclassiication costs change very often. Ideally, one would like to have only one induction, and use the induced model for diierent misclassiication costs. Thus, it demands robustness of the induced model against cost changes. Combining multiple trees gives robust predictions against this ...
متن کاملCost-sensitive Boosting for Concept Drift
Concept drift is a phenomenon typically experienced when data distributions change continuously over a period of time. In this paper we propose a cost-sensitive boosting approach for learning under concept drift. The proposed methodology estimates relevance costs of ‘old’ data samples w.r.t. to ‘newer’ samples and integrates it into the boosting process. We experiment this methodology on usenet...
متن کاملBoosting Trees for Cost-Sensitive Classi cations
This paper explores two boosting techniques for cost-sensitive tree classi cations in the situation where misclassi cation costs change very often. Ideally, one would like to have only one induction, and use the induced model for di erent misclassi cation costs. Thus, it demands robustness of the induced model against cost changes. Combining multiple trees gives robust predictions against this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2015
ISSN: 1041-4347
DOI: 10.1109/tkde.2015.2391115